Solving BSDE with adaptive control variate. A note on the rate of convergence of the operator P
نویسندگان
چکیده
This note is a complement of the paper " Solving BSDE with adaptive control variate " [1]. It deals with the convergence of the approximating operator P, based on a non parametric regression technique called local averaging, and defined in Definition 1.1. Although the computations are quite standard (see [3], [2]), the specificities of the paper are the following • the support of the variables is unbounded; • the error has to be measured using specific L 2-norms; • errors on the gradient are provided. Let us first introduce some notations • Let C k,l b be the set of continuously differentiable functions φ : (t, x) ∈ [0, T ] × R d with continuous and uniformly bounded derivatives w.r.t. t (resp. w.r.t. x) up to order k (resp. up to order l). • C k p denotes the set of C k−1 functions whose k-th derivative is piecewise continuous. • Functions K(T). K(·) denotes a generic function non decreasing in T which may depend on d, µ, β, on the coefficients b and σ (through σ 0 , σ 1 , c 1,3 (σ), c 0,1 (∂ t σ), c 1,3 (b)) and on other constants appearing in [1, Appendix A]. The parameter β is defined in [1, Section 2.1], µ is defined in [1, Section 3.2], σ 0 and σ 1 are defined in [1, Hypothesis 1].. • Functions K 0 (T). K 0 (T) are analogous to K(T) except that they may also depend on the operator P (through c 1 (K t) and c 2 (K x), defined in Section [1, Section 7].
منابع مشابه
Solving BSDE with Adaptive Control Variate
We present and analyze an algorithm to solve numerically BSDEs based on Picard’s iterations and on a sequential control variate technique. Its convergence is geometric. Moreover, the solution provided by our algorithm is regular both w.r.t. time and space.
متن کاملEffects of Directional Subdividing on adaptive Grid-Embedding (RESEARCH NOTE)
The effects of using both directions and directional subdividing on adaptive gridembedding on the computational time and the number of grid points required for the same accuracy are considered. Directional subdividing is used from the beginning of the adaptation procedure without any restriction. To avoid the complication of unstructured grid, the semi-structured grid was used. It is used to so...
متن کاملOn Efficiency of Non-Monotone Adaptive Trust Region and Scaled Trust Region Methods in Solving Nonlinear Systems of Equations
In this paper we run two important methods for solving some well-known problems and make a comparison on their performance and efficiency in solving nonlinear systems of equations. One of these methods is a non-monotone adaptive trust region strategy and another one is a scaled trust region approach. Each of methods showed fast convergence in special problems and slow convergence in other o...
متن کاملStrong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms
Our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real Hilbert space. So many have used algorithms involving the operator norm for solving split equality fixed point problem, ...
متن کاملRichardson and Chebyshev Iterative Methods by Using G-frames
In this paper, we design some iterative schemes for solving operator equation $ Lu=f $, where $ L:Hrightarrow H $ is a bounded, invertible and self-adjoint operator on a separable Hilbert space $ H $. In this concern, Richardson and Chebyshev iterative methods are two outstanding as well as long-standing ones. They can be implemented in different ways via different concepts.In this paper...
متن کامل